- ordering problem
- иссл. опер. задача упорядочения (класс задач, в которых производится выбор дисциплины обслуживания, в отличие от задач ТМО, в которых дисциплина задана)
Англо-русский экономический словарь.
ordering problem
Смотреть что такое "ordering problem" в других словарях:
Problem of mental causation — The problem of mental causation is a conceptual issue in the philosophy of mind. That problem, in short, is how to account for the common sense idea that intentional thoughts or intentional mental states are causes of intentional actions. The… … Wikipedia
Ordering flowers — To order flowers, a consumer can order from a local brick and mortar flower shop, or choose an online flower delivery, or order flowers by telephone or mail. Traditionally the local florist shop executed most flower deliveries, until the internet … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Constraint satisfaction dual problem — The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such… … Wikipedia
Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques … Wikipedia
Alma Problem — The Alma Problem is an issue of concern to musicologists, historians and biographers who deal with the lives and works of Gustav Mahler and his wife Alma.Alma Mahler (ultimately Alma Mahler Gropius Werfel) was not only an articulate, well… … Wikipedia
Charge ordering — (CO) is a (first or second order) phase transition occurring mostly in strongly correlated materials such as transition metal oxides or organic conductors. Due to the strong interaction, the charge is localized on different sites leading to a… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Dining philosophers problem — In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra… … Wikipedia
Mountain climbing problem — Example of the problem resolution. In mathematics, the mountain climbing problem is a problem of finding conditions two function forming profiles of a two dimensional mountain must satisfy, so that two climbers can start on the bottom on the… … Wikipedia
Dining philosophers problem — Aufbau des Philosophenproblems Es handelt sich bei dem Philosophenproblem (engl. Dining Philosophers Problem) um ein Fallbeispiel aus dem Bereich der Theoretischen Informatik. Dabei soll das Problem der Nebenläufigkeit erklärt werden, und die… … Deutsch Wikipedia
